- hexagonal packing
- гексагональная упаковка
English-russian dictionary of physics. 2013.
English-russian dictionary of physics. 2013.
Packing problem — Part of a series on Puzzles … Wikipedia
Hexagonal lattice — The hexagonal lattice or equilateral triangular lattice is one of the five 2D lattice types.Three nearby points form an equilateral triangle. In images four orientations of such a triangle are by far the most common. They can conveniently be… … Wikipedia
hexagonal close packing — heksagoninė tankioji sanglauda statusas T sritis fizika atitikmenys: angl. hexagonal close packing vok. hexagonal dichteste Kugelpackung, f; hexagonaldichte Kugelpackung, f; hexagonale Kugelpackung, f rus. гексагональная плотная упаковка, f;… … Fizikos terminų žodynas
Hexagonal crystal system — In crystallography, the hexagonal is one of the 7 crystal system, it contains 7 point groups . It has the same symmetry as a right prism with a hexagonal base. There is only one hexagonal Bravais lattice, which has six atoms per unit… … Wikipedia
hexagonal closest packing — heksagoninė tankiausioji sanglauda statusas T sritis chemija apibrėžtis Tankiausioji sanglauda, kurioje galima išskirti heksagoninę elementariąją gardelę. atitikmenys: angl. hexagonal closest packing rus. гексагональная плотнейшая упаковка … Chemijos terminų aiškinamasis žodynas
hexagonal dichteste Kugelpackung — heksagoninė tankioji sanglauda statusas T sritis fizika atitikmenys: angl. hexagonal close packing vok. hexagonal dichteste Kugelpackung, f; hexagonaldichte Kugelpackung, f; hexagonale Kugelpackung, f rus. гексагональная плотная упаковка, f;… … Fizikos terminų žodynas
Circle packing — This article describes the packing of circles on surfaces. For the related article on circle packing with a prescribed intersection graph, please see the circle packing theorem. The most efficient way to pack different sized circles together is… … Wikipedia
Circle packing in an equilateral triangle — is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and… … Wikipedia
Close-packing of spheres — hcp and fcc close packing of spheres In geometry, close packing of spheres is a dense arrangement of equal spheres in an infinite, regular arrangement (or lattice). Carl Friedrich Gauss proved that the highest average density – that is, the… … Wikipedia
Sphere packing — In mathematics, sphere packing problems are problems concerning arrangements of non overlapping identical spheres which fill a space. Usually the space involved is three dimensional Euclidean space. However, sphere packing problems can be… … Wikipedia
Centered hexagonal number — A centered hexagonal number, or hex number, is a centered figurate number that represents a hexagon with a dot in the center and all other dots surrounding the center dot in a hexagonal lattice. The n th centered hexagonal number is given by the… … Wikipedia